-
1 диагонализация матриц смежности приводит к собственны
Универсальный русско-английский словарь > диагонализация матриц смежности приводит к собственны
-
2 матрицы смежности
Makarov: adjacency matrices -
3 индексы, основанные на собственных векторах матриц смежности и расстояний
Универсальный русско-английский словарь > индексы, основанные на собственных векторах матриц смежности и расстояний
См. также в других словарях:
Adjacency matrix — In mathematics and computer science, an adjacency matrix is a means of representing which vertices (or nodes) of a graph are adjacent to which other vertices. Another matrix representation for a graph is the incidence matrix. Specifically, the… … Wikipedia
List of matrices — This page lists some important classes of matrices used in mathematics, science and engineering: Matrices in mathematics*(0,1) matrix a matrix with all elements either 0 or 1. Also called a binary matrix . *Adjugate matrix * Alternant matrix a… … Wikipedia
Seidel adjacency matrix — In mathematics, in graph theory, the Seidel adjacency matrix of a simple graph G (also called the Seidel matrix and the original name the (−1,1,0) adjacency matrix) is the symmetric matrix with a row and column for each vertex, having 0 on the… … Wikipedia
Kronecker product — In mathematics, the Kronecker product, denoted by otimes, is an operation on two matrices of arbitrary size resulting in a block matrix. It is a special case of a tensor product. The Kronecker product should not be confused with the usual matrix… … Wikipedia
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Distance matrix — In mathematics, computer science and graph theory, a distance matrix is a matrix (two dimensional array) containing the distances, taken pairwise, of a set of points. This matrix will have a size of N×N where N is the number of points, nodes or… … Wikipedia
Matrix theory — is a branch of mathematics which focuses on the study of matrices. Initially a sub branch of linear algebra, it has grown to cover subjects related to graph theory, algebra, combinatorics, and statistics as well.HistoryThe term matrix was first… … Wikipedia
Matrix addition — In mathematics, matrix addition is the operation of adding two matrices by adding the corresponding entries together. However, there are other operations which could also be considered as a kind of addition for matrices, the direct sum and the… … Wikipedia
Tensor product of graphs — In graph theory, the tensor product G × H of graphs G and H is a graph such that * the vertex set of G × H is the Cartesian product V(G) × V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G × H if and only if u is adjacent with v… … Wikipedia
Spectral graph theory — In mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of its adjacency matrix or Laplacian matrix. An undirected graph has a symmetric adjacency … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia